However, there is no area where probabilistic methods are more natural than in combinatorics . 但是,沒(méi)有任何一個(gè)領(lǐng)域比在組合學(xué)中使用概率方法更自然了。
Application of probabilistic method in the sensitivity test 概率統(tǒng)計(jì)在感度測(cè)試中的應(yīng)用
Probabilistic methods for numerical solutions of the exterior dirichlet problem 外問(wèn)題數(shù)值解的概率方法
At last a probabilistic method of structure design of concrete pavement with lcb is advanced 論文還提出了貧混凝土基層混凝土路面的概率型結(jié)構(gòu)設(shè)計(jì)方法。
Reliability design is a kind of modem design method based on probabilistic method and mathematical statistics , whose goal is the reliability of product 可靠性設(shè)計(jì)是以概率論和數(shù)理統(tǒng)計(jì)為基礎(chǔ),以產(chǎn)品可靠性為目標(biāo)的一種現(xiàn)代設(shè)計(jì)方法。
Markov ' s inequality and four kinds of lovasz local lemma , and give different applications in hypergraphs with these probabilistic methods , we find different conditions for a hypergraph to be 2 - colorable with some kinds of thinkings ) sz局部引理的內(nèi)容,給出了這幾種概率方法在超圖上的應(yīng)用,用幾種思路找到了超圖存在2 -可染色的不同條件,其中著重對(duì)一般形式的lov (
Alike with the convex modeling of uncertainties , the presented method requires less for available information than probabilistic method , thereby , which provided a possible choice for the reliability analysis and design of structures when available information is lack or limited 和不確定性的凸集模型描述一樣,所提方法對(duì)不確定參量已知數(shù)據(jù)的要求較低。且直觀、簡(jiǎn)捷。從而為掌握數(shù)據(jù)信息較少時(shí)結(jié)構(gòu)的可靠性評(píng)估提供了依據(jù)。
Based on the facts in our country , this paper raised that the method of probability should be used in electrical tractor system . and at the same time , the main problems and availableln of this method . based on matlab , the model of probabilistic method and monte carlo simulation in superposition multi - harmonics sources are compared 與此同時(shí),探討了目前國(guó)內(nèi)外對(duì)該問(wèn)題處理所使用的方法的局限性和缺陷,針對(duì)本國(guó)的電牽引系統(tǒng)的實(shí)際情況,提出了在電牽引系統(tǒng)的多諧波疊加中使用基于中心極限定理的概率分析方法,指出針對(duì)高次諧波運(yùn)用該方法的可靠性和對(duì)低次諧波不能有效模擬的原因所在。
The probabilistic method is a nonconstructive method, primarily used in combinatorics and pioneered by Paul Erd?s, for proving the existence of a prescribed kind of mathematical object. It works by showing that if one randomly chooses objects from a specified class, the probability that the result is of the prescribed kind is more than zero.